Parallelizing the dual revised simplex method
نویسندگان
چکیده
منابع مشابه
Parallelizing the dual revised simplex method
This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and exploits parallelism across multiple iterations. The other, called SIP, exploits purely single iteration parallelism by overlapping computational c...
متن کاملParallelizing the Dual Simplex Method Parallelizing the Dual Simplex Method
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...
متن کاملParallelizing the Dual Simplex Method
We study the parallelization of the steepest-edge version of the dual sim-plex algorithm. Three diierent parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...
متن کاملA High Performance Dual Revised Simplex Solver
When solving families of related linear programming (LP) problems and many classes of single LP problems, the simplex method is the preferred computational technique. Hitherto there has been no efficient parallel implementation of the simplex method that gives good speed-up on general, large sparse LP problems. This paper presents a variant of the dual simplex method and a prototype parallelisa...
متن کاملThe dual simplex method with bounds
• By convention, the vector formed by taking together all the basic variables is denoted xB. Similarly, cB, `B and uB are formed by taking together the same indices of c, ` and u, respectively. The same notation is also used for the indices in L and U , giving cL, cU , `L, `U , uL, and uU . We already defined B as taking together the basic columns of A. The remaining (nonbasic) columns form the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2017
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-017-0130-5